Approximate norm descent methods for constrained nonlinear systems
نویسندگان
چکیده
منابع مشابه
Approximate norm descent methods for constrained nonlinear systems
We address the solution of convex-constrained nonlinear systems of equations where the Jacobian matrix is unavailable or its computation/storage is burdensome. In order to efficiently solve such problems, we propose a new class of algorithms which are “derivativefree” both in the computation of the search direction and in the selection of the steplength. Search directions comprise the residuals...
متن کاملNorm descent conjugate gradient methods for solving symmetric nonlinear equations
Nonlinear conjugate gradient method is very popular in solving large-scale unconstrained minimization problems due to its simple iterative form and lower storage requirement. In the recent years, it was successfully extended to solve higher-dimension monotone nonlinear equations. Nevertheless, the research activities on conjugate gradient method in symmetric equations are just beginning. This s...
متن کاملConstrained Dogleg Methods for Nonlinear Systems with Simple Bounds Constrained Dogleg Methods for Nonlinear Systems with Simple Bounds *
We focus on the numerical solution of medium scale bound-constrained systems of nonlinear equations. In this context, we consider an affinescaling trust region approach that allows a great flexibility in choosing the scaling matrix used to handle the bounds. The method is based on a dogleg procedure tailored for constrained problems and so, it is named Constrained Dogleg method. It generates on...
متن کاملApproximate explicit receding horizon control of constrained nonlinear systems
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controllers to be implemented via an efficient binary tree search, avoiding real-time optimization. This is of significant benefit in applications that requires low real-time computational complexity or software complexity. The...
متن کاملSolving norm constrained portfolio optimization via coordinate-wise descent algorithms
In this paper we demonstrate that coordinate-wise descent algorithms can be used to solve portfolio selection problems in which asset weights are constrained by l q norms for 1 ≤ q ≤ 2. A special case of the such problems is when q = 1. The l 1 norm constraint promotes zero values for the weight vector, leading to an automatic asset selection for the portfolio. We first consider the case of min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2017
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3251